Surface Coloring of Metal Cultural Artifacts
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولBuilding the Cultural Artifacts of the Organization
The culture of an organization can be grown and disseminated by infusing it in the artifacts of the organization. These artifacts can be physical things, informational objects, or conceptual artifacts. As people internal and external to the organization encounter these artifacts, they also encounter the culture. This paper focuses on conceptual artifacts—such as stories, metaphors, activities, ...
متن کاملMetal Artifacts in Computed Tomography
Karin Andersson (2018): Metal Artifacts in Computed Tomography – impact of reduction methods on image quality and radiotherapy treatment planning. Örebro Studies in Medicine 172. Degradation of image quality by metal artifacts is a common problem in computed tomography (CT) imaging, which can limit the diagnostic value of a CT examination and also introduce inaccuracies in radiotherapy (RT) tre...
متن کاملUsing CAPTCHAs to Index Cultural Artifacts
Rock art, human-made markings on stone, is an important cultural artifact and the earliest expression of abstract thinking. While there are tens of millions of photographs of rock art in existence, there have been no large-scale attempts to organize, classify or cluster them. This omission is not due to a lack of interest, but reflects the extraordinary difficultly of extracting useful data fro...
متن کاملSolving Graph Coloring Problems Using Cultural Algorithms
In this paper, we combine a novel Sequential Graph Coloring Heuristic Algorithm (SGCHA) with a non-systematic method based on a cultural algorithm to solve the graph coloring problem (GCP). The GCP involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In our solving approach, we first use an estimator which is implemented...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society of Colour Material
سال: 1989
ISSN: 0010-180X
DOI: 10.4011/shikizai1937.62.658